- hierarchy input
- входные иерархические данные
Авиасловарь. М.А.Левин. 2004.
Авиасловарь. М.А.Левин. 2004.
Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example … Wikipedia
Space hierarchy theorem — In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. For… … Wikipedia
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
Chomsky hierarchy — Within the field of computer science, specifically in the area of formal languages, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars. This hierarchy of… … Wikipedia
Filesystem Hierarchy Standard — Beispiel eines Standard Stammverzeichnisses Basisdaten Maintainer … Deutsch Wikipedia
HIPO — Hierarchy Input Process Output (design technique) … IT glossary of terms, acronyms and abbreviations
HIPO — Hierarchical Input Process Output (Computing » General) Hierarchical Input Process Output (Academic & Science » Mathematics) Hierarchical Input Process Output (Computing » General) **** Hierarchy Input Process Output (Computing » File Extensions) … Abbreviations dictionary
HIPO-Methode — Hierarchy Plus Input Process Output Method. 1. Begriff: (1) ⇡ Softwareentwurfsmethode; (2) Darstellungsmittel für die ⇡ Programmentwicklung. 2. Bestandteile: a) Inhaltsübersicht (Visual Table of Contents): Graphische Übersicht, in der alle ⇡… … Lexikon der Economics
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Memory-prediction framework — The memory prediction framework is a theory of brain function that was created by Jeff Hawkins and described in his 2004 book On Intelligence. This theory concerns the role of the mammalian neocortex and its associations with the hippocampus and… … Wikipedia